Equivalence class universal cycles for permutations
نویسندگان
چکیده
منابع مشابه
Equivalence class universal cycles for permutations
We construct a universal cycle of n-permutations using n + 1 symbols and an equivalence relation based on differences. Moreover a complete family of universal cycles of this kind is constructed.
متن کاملUniversal cycles for permutations
A universal cycle for permutations is a word of length n! such that each of the n! possible relative orders of n distinct integers occurs as a cyclic interval of the word. We show how to construct such a universal cycle in which only n + 1 distinct integers are used. This is best possible and proves a conjecture of Chung, Diaconis and Graham.
متن کاملFaster Generation of Shorthand Universal Cycles for Permutations
A universal cycle for the k-permutations of 〈n〉 = {1, 2, ..., n} is a circular string of length (n)k that contains each k-permutation exactly once as a substring. Jackson (Discrete Mathematics, 149 (1996) 123–129) proved their existence for all k ≤ n − 1. Knuth (The Art of Computer Programming, Volume 4, Fascicle 2, Addison-Wesley, 2005) pointed out the importance of the k = n − 1 case, where e...
متن کاملHamiltonicity of digraphs for universal cycles of permutations
The digraphs P (n, k) have vertices corresponding to length k permutations of an n set and arcs corresponding to (k + 1) permutations. Answering a question of Starling, Klerlein, Kier and Carr we show that these digraphs are Hamiltonian for k ≤ n − 3. We do this using restricted Eulerian cycles and the fact that P (n, k) is nearly the line digraph of P (n, k−1). We also show that the digraphs P...
متن کاملExplicit Constructions of Universal Cycles on Partial Permutations
A k-partial permutation out of n elements is a k-tuple (p1, p2, . . . , pk) with k distinct elements and pi ∈ [n] = {1, 2, . . . , n}, i = 1, 2, . . . , k. Let (p1, p2 . . . , pn) be a full permutation of size n, where the elements are distinct and pi ∈ [n], i = 1, 2, . . . , n. Then we say the k-partial permutation (p1, p2, . . . , pk) is induced from the full permutation. A universal cycle on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1996
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00314-9